The binary Goldbach problem with one prime of the form p = k 2 + l 2 + 1
نویسنده
چکیده
We prove that almost all integers n ≡ 0 or 4 (mod 6) can be written in the form n = p1 + p2, where p1 = k 2 + l + 1 with (k, l) = 1. The proof is an application of the half-dimensional and linear sieves with arithmetic information coming from the circle method and the Bombieri-Vinogradov prime number theorem.
منابع مشابه
A Binary Additive Equation Involving Fractional Powers
with integers m1, m2; henceforth, [θ] denotes the integral part of θ. Subsequently, the range for c in this result was extended by Gritsenko [3] and Konyagin [5]. In particular, the latter author showed that (1) has solutions in integers m1, m2 for 1 < c < 3 2 and n sufficiently large. The analogous problem with prime variables is considerably more difficult, possibly at least as difficult as t...
متن کاملA proof of strong Goldbach conjecture
In this paper we give a proof of the strong Goldbach conjecture by studying limit status of original continuous Godbach natural number sequence {3, 4, ..., GNL} generated by original continuous odd prime number sequence {3, 5, ..., p} when p → ∞, that is, GNL = p when p → ∞. It implies the weak Goldbach conjecture. If a prime p is defined as Goldbach prime when GNL = p then Goldbach prime is th...
متن کاملThe ternary Goldbach problem
Leonhard Euler (1707–1783) – one of the greatest mathematicians of the eighteenth century and of all times – often corresponded with a friend of his, Christian Goldbach (1690–1764), an amateur and poly-math who lived and worked in Russia, just like Euler himself. In a letter written in June 1742, Goldbach made a conjecture – that is, an educated guess – on prime numbers: Es scheinet wenigstens,...
متن کاملSieve Method and Landau Problems
At the 1912 Fifth International Congress of Mathematicians (Cambridge), Landau mentioned four unattackable problems: Goldbach Conjecture; Twin Prime Conjecture; for each n, there is a prime p such that n2 < p < (n+1)2; there are infinitely many primes p of the form p = n2+1. As Erdős [6, preface] maintained five years ago, we still do not have a satisfactory solution for each of them. For large...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010